Modeling Group Communication Protocols Using Multiset Term Rewriting

Typed Multiset Rewriting Specifications of Security Protocols

The language MSR has successfully been used in the past to prove undecidability results about security protocols modeled according to the Dolev-Yao abstraction. In this paper, we revise this formalism into a flexible specification framework for complex crypto-protocols. More specifically, we equip it with an extensible typing infrastructure based on dependent types with subsorting, which elegan...

Relating Process Algebras and Multiset Rewriting for Immediate Decryption Protocols

When formalizing security protocols, different specification languages support very different reasoning methodologies, whose results are not directly or easily comparable. Therefore, establishing clear mappings among different frameworks is highly desirable, as it permits various methodologies to cooperate by interpreting theoretical and practical results of one system in another. In this paper...

Multiset rewriting and the complexity of bounded security protocols

We formalize the Dolev-Yao model of security protocols, using a notation based on multi-set rewriting with existentials. The goals are to provide a simple formal notation for describing security protocols, to formalize the assumptions of the Dolev-Yao model using this notation, and to analyze the complexity of the secrecy problem under various restrictions. We prove that, even for the case wher...

Multiset rewriting by multiset onstraint solving

Constrained Multiset Rewriting

We investigate model checking of a computation model called Constrained Multiset Rewriting Systems (CMRS). A CMRS operates on configurations which are multisets of monadic predicate symbols, each with an argument ranging over the natural numbers. The transition relation is defined by a finite set of rewriting rules which are conditioned by simple inequalities on variables and constants. This mo...